Skip to main content

All Questions

2votes
3answers
278views

BST traverse as higher order function [closed]

Consider the following function to traverse a BST ...
mwal's user avatar
  • 483
3votes
1answer
57views

Utmost function that takes a comparator function

I'm working through Paul Graham's "ANSI Common Lisp". In Chapter 6 (p105), he introduces the idea of utility functions. He points out these are core to bottom-up programming and reusability. He ...
mwal's user avatar
  • 483
4votes
0answers
75views

Pure functional code for the sublists of a list

The code below gives me the list of sublists of a list. Code can still be improved to avoid the use of append, right? ...
Alexandre Rademaker's user avatar
3votes
1answer
117views

Golden Section Search in Lisp

I implemented the golden section search algorithm recursively in Lisp. My code is: ...
Paulo Mendes's user avatar
7votes
2answers
449views

Sundaram's sieve in Common Lisp

I have this Sundaram's sieve to generate prime numbers up to limit in Common Lisp. ...
Mirzhan Irkegulov's user avatar
4votes
1answer
299views

First Common Lisp vector math code

I'm studying Common Lisp on my own. Coming from C++, Common Lisp feels kind of strange sometimes. I'd like to get some feedback on what I understood so far. For learning purposes, I wrote this simple ...
Jan Deinhard's user avatar

close